Queues, stores, and tableaux

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Queues, stores, and tableaux

Consider the single server queue with an infinite buffer and a FIFO discipline, either of type M/M/1 or Geom/Geom/1. Denote by A the arrival process and by s the services. Assume the stability condition to be satisfied. Denote by D the departure process in equilibrium and by r the time spent by the customers at the very back of the queue. We prove that (D, r) has the same law as (A, s) which is...

متن کامل

, Stores , and Tableaux

Consider the single server queue with an infinite buffer and a FIFO discipline, either of type M/M/1 or Geom/Geom/1. Denote by A the arrival process and by s the services. Assume the stability condition to be satisfied. Denote by D the departure process in equilibrium and by r the time spent by the customers at the very back of the queue. We prove that (D, r) has the same law as (A, s) which is...

متن کامل

Achieving Data-Aware Load Balancing through Distributed Queues and Key/Value Stores

Load balancing techniques (e.g. work stealing) are important to obtain the best performance for distributed task scheduling system. In work stealing, tasks are randomly migrated from heavy-loaded schedulers to idle ones. However, for data-intensive applications where tasks are dependent and task execution involves processing large amount of data, migrating tasks blindly would compromise the dat...

متن کامل

HyperS Tableaux - Heuristic Hyper Tableaux

Several syntactic methods have been constructed to automate theorem proving in first-order logic. The positive (negative) hyper-resolution and the clause tableaux were combined in a single calculus called hyper tableaux in [1]. In this paper we propose a new calculus called hyperS tableaux which overcomes substantial drawbacks of hyper tableaux. Contrast to hyper tableaux, hyperS tableaux are e...

متن کامل

Analytic Tableaux and Interpolation

A tableau system for the predicate logic with countable conjunctions and disjunctions is presented and the completeness of the set of rules proved. These tableaux are used to prove a slightly more general form of the Malitz interpolation theorem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2005

ISSN: 0021-9002,1475-6072

DOI: 10.1017/s0021900200001170